The optimal course bidding strategy under limited resource constraint using genetic algorithm

نویسندگان

چکیده

In a course bidding system, there are more students than the number of available seats for course. To enroll course, have to bid using their tokens and system will fill up with top bidders. Since limit tokens, they allocate wisely. this paper, we apply genetic algorithm search best way such that it maximizes probability successful enrollment. estimate probability, train logistic regression on registration data model achieves 77.11% accuracy. By synthesized dataset, compare effectiveness suggested by other approaches as heuristics excel build-in solver. The result shows 69 out 78 higher average enrollment when algorithm.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bidding Strategy on Demand Side Using Eligibility Traces Algorithm

Restructuring in the power industry is followed by splitting different parts and creating a competition between purchasing and selling sections. As a consequence, through an active participation in the energy market, the service provider companies and large consumers create a context for overcoming the problems resulted from lack of demand side participation in the market. The most prominent ch...

متن کامل

Optimal Bidding Strategy in an Open Electricity Market using Genetic Algorithm

In this paper optimal bidding strategy problem modeled as a stochastic optimization problem and solved using Genetic Algorithm (GA). In an open electricity market environment, maximizing profit by suppliers is possible through strategic bidding. Because of the gaming by participants (power suppliers and large consumers) in an open electricity market, this is more an oligopoly than a competitive...

متن کامل

Multiple Resource Constraint Time-Cost-Resource Optimization Using Genetic Algorithm

Simultaneous optimization of time, cost, and utilized resources in a construction project is vital. This paper presents a GA based model for determination of the best combination of the time, cost, and resources in a multiple resource constraint problem. The proposed model considers both resource allocation and leveling simultaneously. Since the problem is assumed to be resource constraint, res...

متن کامل

Optimal Genetic View Selection Algorithm Under Space Constraint

Materialized view selection problem is one of the most important decisions in designing a data warehouse. In order to efficiently solve the problem, a modified genetic algorithm for how to select a set of views to be materialized so as to achieve both good query performance and low view maintenance cost under a storage space constraint is proposed. The essential idea of the algorithm is as foll...

متن کامل

Grouping maintenance strategy with availability constraint under limited repairmen

The paper deals with a development of the rolling horizon approach introduced recently for grouping maintenance strategies of multi-component systems by integrating two efficient optimization algorithms. The proposed approach can help to construct an optimal maintenance planning with a given availability constraint under limited repairmen. Thanks to the rolling horizon spirit, the maintenance p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Warasan Ngan Wichai lae Phatthana Cherng Prayuk doi Samakhon ECTI

سال: 2023

ISSN: ['2773-918X']

DOI: https://doi.org/10.37936/ectiard.2023-3-2.249350